s1=input()
s1=s1.lower()
s2=input()
s2=s2.lower()
dic ={}
for i in range(len(s1)):
dic[s1[i]]=s2[i]
s3=input()
for i in range(len(s3)):
if s3[i].islower():
print(dic[s3[i]], end="")
elif s3[i].isupper():
string2=s3[i]
string2=string2.lower()
string= dic[string2]
print(string.upper(), end="")
else:
print(s3[i], end="")
#include<bits/stdc++.h>
using namespace std;
string firstlayout,secondlayout,typedinthefirstlayout;
map<char,char> mp;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> firstlayout >> secondlayout >> typedinthefirstlayout;
for(int i=0;i<26;i++)
{
mp[firstlayout[i]]=secondlayout[i];
mp[firstlayout[i]-32]=secondlayout[i]-32;
}
for(int i=0;i<typedinthefirstlayout.size();i++)
{
if(typedinthefirstlayout[i]>='0' && typedinthefirstlayout[i]<='9')
cout << typedinthefirstlayout[i];
else cout << mp[typedinthefirstlayout[i]];
}
}
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |